Cube Theory and k-error Linear Complexity Profile
نویسندگان
چکیده
منابع مشابه
Cube Theory and k-error Linear Complexity Profile
The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2 n , a new tool called cube theory is developed. In this paper, we first give a general decomposition approach to decompose a binary sequence with period 2 n into some disjoint cubes. Second, a...
متن کاملOn the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory
The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and k-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable k-error linear complexity is proposed to study sequences with stable and large k-error linear complexity...
متن کامل$k$-Error linear complexity for multidimensional arrays
In this paper, we focus on linear complexity measures of multidimensional sequences over finite fields, generalizing the one-dimensional case and including that of multidimensional arrays (identified with multidimensional periodic sequence) as a particular instance. A cryptographically strong sequence or array should not only have a high linear complexity, it should also not be possible to decr...
متن کاملOn the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory
The linear complexity and the k-error linear complexity of a sequence are important security measures for key stream strength. By studying sequences with minimum Hamming weight, a new tool called hypercube theory is developed for p-periodic binary sequences. In fact, hypercube theory is very important in investigating critical error linear complexity spectrum proposed by Etzion et al. To demons...
متن کاملOn the k-error linear complexity of cyclotomic sequences
Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall’s sextic residue sequence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security and Its Applications
سال: 2016
ISSN: 1738-9976,1738-9976
DOI: 10.14257/ijsia.2016.10.7.15